Kovalenko's Full-Rank Limit and Overhead as Lower Bounds for Error-Performances of LDPC and LT Codes over Binary Erasure Channels
نویسندگان
چکیده
We present Kovalenko’s full-rank limit as a tight lower bound for decoding error probability of LDPC codes and LT codes over BEC. From the limit, we derive a full-rank overhead as a lower bound for stable overheads for successful maximum-likelihood decoding of the codes.
منابع مشابه
Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channels
The asymptotic iterative decoding performances of low-density parity-check (LDPC) codes using min-sum (MS) and sum-product (SP) decoding algorithms on memoryless binary-input output-symmetric (MBIOS) channels are analyzed in this paper. For MS decoding, the analysis is done by upper bounding the bit error probability of the root bit of a tree code by the sequence error probability of a subcode ...
متن کاملA Tight Estimate for Decoding Error-Probability of LT Codes with Dense Rows
A novel approach of estimating Decoding Error-Probability (DEP) of LT codes, using the conditional Kovalenko’s Rank-Distribution, is proposed. The estimate is utilized for constructing optimal LT codes with dense rows achieving the DEP that is very close to Kovalenko’s FullRank Limit. Experimental evidences which show the viability of the estimate is also provided. INTRODUCTION AND BACKGROUNDS ...
متن کاملOn Universal Properties of Capacity-Approaching LDPC Ensembles
This paper provides some universal information-theoretic bounds related to capacity-approaching ensembles of low-density parity-check (LDPC) codes. These bounds refer to the behavior of the degree distributions of such ensembles, and also to the graphical complexity and the fundamental system of cycles associated with the Tanner graphs of LDPC ensembles. The transmission of these ensembles is a...
متن کاملLuby Transform Codes with Priority Encoding
Rateless codes over a binary erasure channel (BEC) provide successful transmission independent of the erasure probability. Luby Transform (LT) codes and raptor codes are examples of rateless codes over a BEC. For successful decoding, LT codes require either a large overhead at linear complexity, or capacity-approaching overheads with nonlinear complexity. When overhead is low at linear complexi...
متن کاملExhausting Error-Prone Patterns in LDPC Codes
It is proved in this work that exhaustively determining bad patterns in arbitrary, finite low-density paritycheck (LDPC) codes, including stopping sets for binary erasure channels (BECs) and trapping sets (also known as nearcodewords) for general memoryless symmetric channels, is an NP-complete problem, and efficient algorithms are provided for codes of practical short lengths n ≈ 500. By explo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008